Reducing Computation Time in a Reaction-Diffusion Stereo Algorithm
نویسندگان
چکیده
A reaction-diffusion stereo algorithm consists of multi-sets of reaction-diffusion equations. Since the equations are described with time-evolving partialdifferential equations, they require much computation time. In addition, the previous algorithm does not state any criterion for convergence judgement; we need to compute the equations for enough duration of time until their solutions converge. In this work, for reducing computation time in the algorithm, we propose a criterion for convergence judgement and implement the algorithm on a multiprocessor computer system.
منابع مشابه
Enhanced Stereo Matching Technique using Image Gradient for Improved Search Time
Stereo matching algorithms developed from local area based correspondence matching involve extensive search. This paper presents a stereo matching technique for computation of a dense disparity map by trimming down the search time for the local area based correspondence matching. We use constraints such as epipolar line, limiting the disparity, uniqueness and continuity to obtain an initial den...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملReal-Time Disparity Map Computation Based On Disparity Space Image
The current paper proposes a real-time dense stereo matching algorithm based on a DSI (Disparity Space Image ) data structure that can produce accurate disparity map. Our approach divides the disparity map computing into two main steps. The first step deals with the computing of the initial disparity map using DSI method. The second step presents a simple and a fast method to refine the initial...
متن کاملAccurate Real-time Disparity Map Computation Based on Variable Support Window
We propose in this paper a real-time dense stereo matching algorithm using variable support window for disparity map computing. Basic real-time local algorithms relying on a fixed and rectangular correlation window suffer from the difficulty for window-based methods lies in determining the best window shape and size for each pixel. This work proposes a novel local approach using a combination o...
متن کاملReaction-Diffusion Algorithm for Vision Systems
Vision systems require fundamental algorithms of image processing and vision computing. Algorithms of edge detection, grouping and stereo disparity detection are typical examples. Marr and his collaborators proposed several effective algorithms of edge detection and stereo disparity detection, in particular, in a computational approach (Marr, 1982). Marr and Hildreth had previously proposed an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009